An Enumerative Method for Encoding Spectrum Shaped Binary Run-Length Constrained Sequences
نویسنده
چکیده
A method for encoding and decoding spectrum shaped binary run-length constrained sequences is described. The binary sequences with predefined range of exponential sums are introduced. On the base of Cover’s enumerative scheme, recurrence relations for calculating the number of these sequences are derived. Implementation of encoding and decoding procedures is also shown.
منابع مشابه
Coding for delay-insensitive communication with partial synchronization
C. E. Shannon, “A mathematical theory of communication,” Bell Syst. Tech. J., vol. 27, pp. 379-423, July 1948. P. A. Franaszek, “Sequence-state coding for digital transmission,” Bell Syst. Tech. J., vol. 47, pp. 143-157, Jan. 1968. G. F. M. Beenker and K. A. Schouhamer Immink, “A generalized method for encoding and decoding run-length-limited binary sequences,” IEEE Trans. Inform. Theory, vol. ...
متن کاملLossless compression catalyst based on binary allocation via modular arithmetic
A new binary (bit-level) lossless compression catalyst method based on a modular arithmetic, called Binary Allocation via Modular Arithmetic (BAMA), has been introduced in this paper. In other words, BAMA is for storage and transmission of binary sequences, digital signal, images and video, also streaming and all kinds of digital transmission. As we said, our method does not compress, but facil...
متن کاملError Propagation Assessment of Enumerative Coding Schemes Kees
2591 consisting of two four-state trellises. To this point, though, no new codes comparable to, for example, the rate 4=5 and the rate 8=9 MTR codes in [10] for the (1 0 D) (1 + D) 3 and (1 0 D) (1 + D) 4 channels have been found. For future work, an interesting research problem would be to relax the trellis-matching constraint to enlarge the constellations, thus obtaining higher-rate codes. Of...
متن کاملFinite State Machine Binary Entropy Coding
A method of universal binary entropy coding using simple state machines is presented. We provide a natural rationale for the use of state machines. We discuss the building of state machines which produce uniquely decodable bit streams. Some state machines implement known codes, while others implement finite or even infinite variable length to variable length codes. Once a decodable state machin...
متن کاملselected recording codes
Most recording systems encode their data using binary run-length-limited (RLL) codes. Statistics such as the density of Is, the probabilities of specific code strings or run lengths, and the power spectrum are useful in analyzing the performance of RLL codes in these applications. These statistics are easy to compute for ideal run-length-limited codes, those whose only constraints are the run-l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1001.4334 شماره
صفحات -
تاریخ انتشار 2010